Two-player pebbling on diameter 2 graphs

A pebbling move refers to the act of removing two pebbles from one vertex and placing pebble on an adjacent vertex. The goal graph is: Given initial distribution pebbles, use moves reach a specified called root. number \(\pi (G)\) is minimum needed so every can choice We introduce new variant pebbling, game between players. One player aims root other prevent this. show configurations various classes graphs for which each has winning strategy. will characterize specific class diameter graphs.